Randomized algorithms in numerical linear algebra
نویسندگان
چکیده
This survey provides an introduction to the use of randomization in the design of fast algorithms for numerical linear algebra. These algorithms typically examine only a subset of the input to solve basic problems approximately, including matrix multiplication, regression and low-rank approximation. The survey describes the key ideas and gives complete proofs of the main results in the field. A central unifying idea is sampling the columns (or rows) of a matrix according to their squared lengths.
منابع مشابه
Randomized Algorithms for Matrices and Data Lecture 1 - 09 / 04 / 2013 Lecture 1 : Introduction and Overview
This course will cover recent developments in randomized matrix algorithms of interest in large-scale machine learning and statistical data analysis applications. By this, we will mean basic algorithms for fundamental matrix problems—such as matrix multiplication, least-squares regression, lowrank matrix approximation, and so on—that use randomization in some nontrivial way. This area goes by t...
متن کاملRandomized Linear Algebra Approaches to Estimate the Von Neumann Entropy of Density Matrices
The von Neumann entropy, named after John von Neumann, is the extension of classical entropy concepts to the field of quantummechanics and, from a numerical perspective, can be computed simply by computing all the eigenvalues of a density matrix, an operation that could be prohibitively expensive for large-scale density matrices. We present and analyze two randomized algorithms to approximate t...
متن کاملNumerical solution of a system of fuzzy polynomial equations by modified Adomian decomposition method
In this paper, we present some efficient numerical algorithm for solving system of fuzzy polynomial equations based on Newton's method. The modified Adomian decomposition method is applied to construct the numerical algorithms. Some numerical illustrations are given to show the efficiency of algorithms.
متن کاملFast Randomized Iteration: Diffusion Monte Carlo through the Lens of Numerical Linear Algebra
We review the basic outline of the highly successful diffusion Monte Carlo technique commonly used in contexts ranging from electronic structure calculations to rare event simulation and data assimilation, and propose a new class of randomized iterative algorithms based on similar principles to address a variety of common tasks in numerical linear algebra. From the point of view of numerical li...
متن کاملRandomized Communication Complexity for Linear Algebra Problems over Finite Fields
Finding the singularity of a matrix is a basic problem in linear algebra. Chu and Schnitger [3] first considered this problem in the communication complexity model, in which Alice holds the first half of the matrix and Bob holds the other half. They proved that the deterministic communication complexity is Ω(n2 log p) for an n×n matrix over the finite field Fp. Then, Clarkson and Woodruff [4] i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017